Voxelized Minkowski sum computation on the GPU with robust culling
نویسندگان
چکیده
منابع مشابه
Voxelized Minkowski sum computation on the GPU with robust culling
We present a new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs). We first cull out surface primitives that will not contribute to the final boundary of the Minkowski sum, analyzing and adaptively bounding the rounding errors of the culling algorithm to solve the floating point error ...
متن کاملRobust polyhedral Minkowski sums with GPU implementation
We present a Minkowski sum algorithm for polyhedra based on convolution. We develop robust CPU and GPU implementations, using our ACP robustness technique to enforce a user-specified backward error bound. We test the programs on 45 inputs with an error bound of 10−8. The CPU program outperforms prior work, including non-robust programs. The GPU program exhibits a median speedup factor of 36, wh...
متن کاملContributing vertices-based Minkowski sum computation of convex polyhedra
Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Verticesbased Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of t...
متن کاملOn the Parameterized Computation of Minimum Volume Outer Ellipsoid of Minkowski Sum of Ellipsoids
We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of ellipsoids. We clarify connections among several parameterizations available in the literature, obtain novel analysis results regarding the conditions of optimality, and based on the same, propose two new algorithms for computing the paramet...
متن کاملMinkowski Sum Selection and Finding
Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ R, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p+ q)|p ∈ P, q ∈ Q,A(p+ q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection problem is to find the k largest objective value among all objective ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design
سال: 2011
ISSN: 0010-4485
DOI: 10.1016/j.cad.2011.06.022